Polling systems with breakdowns and repairs

Polling systems with breakdowns and repairs

REPAIRS Oren Nakdimon and Uri Yechiali Department of Statistics and Operations Research School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel [Email: [email protected]; phone +972-3-6409637] Abstract This work analyzes various polling systems with both random breakdowns and repairs. A few works in the literature inves...

Retrial Queues with Server Subject to Breakdowns and Repairs

Homogeneous Finite-source Retrial Queues with Server Subject to Breakdowns and Repairs

This paper deals with a retrial queueing system with a finite number of homogeneous sources of calls and a single non-reliable server, which means that the server is subject to random breakdowns depending on whether it is busy or idle. The failure of the server may block or unblock the systems’s operations and the service of the interrupted request may be resumed or the call can be transmitted ...

A BMAP/G/1 Retrial Queue with a Server Subject to Breakdowns and Repairs

In this paper, we consider a BMAP/G/1 retrial queue with a server subject to breakdowns and repairs, where the life time of the server is exponential and the repair time is general. We use the supplementary variable method, which combines with the matrix-analytic method and the censoring technique, to study the system. We apply the RG-factorization of a level-dependent continuous-time Markov ch...

Modelling Open Networks with Breakdowns, Repairs and Finite Buffers, Using an IPP Departure Process Model

Open queuing network systems are useful in the computer industry. In this paper, a multi-node open network, with heterogeneous nodes, each node serving external as well as routed internal arrivals of jobs is considered. The nodes are prone to failures and repairs, the buffers are of finite size. An approximate performability model is developed based on an IPP departure process. External Poisson...